A Non-commutative Extension of Multiplicative Exponential Linear Logic
نویسندگان
چکیده
We extend multiplicative exponential linear logic (MELL) by a noncommutative, self-dual logical operator. The extended system, called NEL, is defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. We are then able to extend the expressiveness of MELL by modelling a broad notion of sequentiality. We show some proof theoretical results: decomposition and cut elimination. The new operator represents a significant challenge: to get our results we use here for the first time some novel techniques, which constitute a uniform and modular approach to cut elimination, contrary to what is possible in the sequent calculus.
منابع مشابه
Non-Commutative Logic I: The Multiplicative Fragment
We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.
متن کاملThe Undecidability of System NEL
System NEL is a conservative extension of multiplicative exponential linear logic (MELL) by a self-dual non-commutative connective called seq which lives between the par and the times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is quite simple, the proof of the faithfulness is a little intricate because there is no ...
متن کاملA Non-commutative Extension of MELL
We extend multiplicative exponential linear logic (MELL) by a non-commutative, self-dual logical operator. The extended system, called NEL, is defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. We should then be able to extend the range of applications of MELL, by modelling a broad notion of s...
متن کاملA System of Interaction and Structure IV: The Exponentials
We study some normalisation properties of the deep-inference proof system NEL, which can be seen both as 1) an extension of multiplicative exponential linear logic (MELL) by a certain non-commutative self-dual logical operator; and 2) an extension of system BV by the exponentials of linear logic. The interest of NEL resides in: 1) its being Turing complete, while the same for MELL is not known,...
متن کاملSimulating Computations in Second Order Non-Commutative Linear Logic
Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order multiplicative commutative linear logic by embedding LJ2 into this logic. Emms did the same for intuitionistic second order non-commutative linear logic. Recently, Lafont and Scedrov demonstrated undecidability of classical second order multiplicative commutative linear logic. As for classical second order non-com...
متن کامل